Internal Languages for Autonomous and ∗-Autonomous Categories

Internal Languages for Autonomous and *-Autonomous Categories

We introduce a family of type theories as internal languages for autonomous (or symmetric monoidal closed) and-autonomous categories, in the same sense that the simply-typed-calculus with surjective pairing is the internal language for cartesian closed categories. The rules for the typing judgements are presented in the style of Gentzen's Sequent Calculus. A notable feature is the systematic tr...

Autonomous and Non-Autonomous EFL Learners’ Strategies and Practices

Abstract The present study aimed at discovering the practices and strategies autonomous EFL learners pursue in their endeavor to master English. It thus set out in the Iranian context, with 60 EFL learners, both autonomous and non-autonomous, as participants. The gathered data through a questionnaire and an interview were subjected to content and descriptive analysis. The results showed that bo...

Autonomous and Non-Autonomous EFL Learners’ Strategies and Practices

Abstract The present study aimed at discovering the practices and strategies autonomous EFL learners pursue in their endeavor to master English. It thus set out in the Iranian context, with 60 EFL learners, both autonomous and non-autonomous, as participants. The gathered data through a questionnaire and an interview were subjected to content and descriptive analysis. The results showed that bo...

Nonsymmetric *-Autonomous Categories

Topological ∗-autonomous categories, revisited

Given an additive equational category with a closed symmetric monoidal structure and a potential dualizing object, we find sufficient conditions that the category of topological objects over that category has a good notion of full subcategories of strong and weakly topologized objects and show that each is equivalent to the chu category of the original category with respect to the dualizing obj...